Fair Matchings and Related Problems
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems
In this note, the problem of determining disjoint matchings in a set of intervals is investigated (two intervals can be matched if they are disjoint). Such problems find applications in schedules planning. First, we propose a new incremental algorithm to compute maximum disjoint matchings among intervals. We show that this algorithm runs in O(n) time if the intervals are given ordered in input....
متن کاملEfficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
We consider the problem of designing efficient algorithms for computing certain matchings in a bipartite graph G = (A ∪ P, E), with a partition of the edge set as E = E1 ∪̇ E2 . . . ∪̇ Er. A matching is a set of (a, p) pairs, a ∈ A, p ∈ P such that each a and each p appears in at most one pair. We first consider the popular matching problem; an O(m √ n) algorithm to solve the popular matching pro...
متن کاملFair Matchings with an Application to Chess
In this paper we consider the strategic problem of pairing opponents from two teams at a chess meet. We propose using a bias-minimizing stable matching and establish two main results, that a strict dominance relationship between the two teams can be determined in polynomial time, and if such a relationship exists, then a biasminimizing stable matching can be found by the simplex method. We also...
متن کاملComputing Fair and Bottleneck Matchings in Geormetric Graphs
Let A and B be two sets of n points in the plane, and letM be a (one-to-one) matching between A and B. Let min(M ), max(M ), and (M ) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of M respectively. The uniform matching problem (also called the balanced assignment problem, or the fair matching problem) is to nd M U , a matching t...
متن کاملEnumeration of Matchings: Problems and Progress
This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of matchings. The twenty original problems, with commentary, comprise the bulk of the article. I give an account of the progress that has been made on these problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-9994-9